Graph Algebras: Bridges between graph C ∗-algebras and Leavitt path algebras Gene Abrams (University of Colorado at Colorado Springs) Jason Bell (Simon Fraser University) Søren Eilers (University of Copenhagen) George

Source URL: www.birs.ca

Routing by Landmarks Urs-Jakob Rüetschi, University of Zurich David Caduff, University of Zurich Frank Schulz, University of Karlsruhe Alexander Wolff, University of Karlsruhe Sabine Timpf, University of Zurich

Source URL: www.strc.ch

• Graph theory
• Mathematics
• Discrete mathematics
• Routing algorithms
• Edsger W. Dijkstra
• Network theory
• Operations research
• Search algorithms
• Shortest path problem
• A* search algorithm
• Graph
• Node

SEAProgram Monday, June 29th 8:00 8:50 9:00

Source URL: sea2015.lip6.fr

• NP-complete problems
• Computational complexity theory
• Steiner tree problem
• Combinatorial optimization
• Shortest path problem
• Mathematical optimization
• Independent set
• Combinatorics
• Graph theory
• Book:Graph Theory

2014 ASE BIGDATA/SOCIALCOM/CYBERSECURITY Conference, Stanford University, May 27-31, 2014 Real Time Closeness and Betweenness Centrality Calculations on Streaming Network Data Wei Wei

Source URL: www.casos.cs.cmu.edu

• Network theory
• Mathematics
• Graph theory
• Discrete mathematics
• Network analysis
• Networks
• Social networks
• Centrality
• Betweenness centrality
• Social network analysis
• Closeness centrality
• Shortest path problem

Fast A3 Algorithms for Multiple Sequence Alignment Takahiro Ikeda Hiroshi Imai

Source URL: www.jsbi.org

• Graph theory
• Mathematics
• Routing algorithms
• Network theory
• Edsger W. Dijkstra
• Shortest path problem
• Dynamic programming
• Edge disjoint shortest pair algorithm
• K shortest path routing

6.889 — Lecture 11: Multiple-Source Shortest Paths Christian Sommer (figures by Philip Klein) October 19, 2011 Single-Source Shortest Path (SSSP) Problem: given a graph G = (V, E) and a source vertex s ∈

Source URL: courses.csail.mit.edu

Start Destination The Landmark Spider: Weaving the Landmark Web

Source URL: www.strc.ch

• Routing algorithms
• Mathematics
• Edsger W. Dijkstra
• Network theory
• Game artificial intelligence
• Graph theory
• Geography
• Search algorithms
• Wayfinding
• A* search algorithm
• Shortest path problem
• Landmark

Directed Graph Exploration Klaus-Tycho Foerster and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {k-t.foerster,wattenhofer}@tik.ee.ethz.ch

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Combinatorial optimization
• Edsger W. Dijkstra
• Routing algorithms
• Search algorithms
• Graph traversal
• Shortest path problem
• A* search algorithm
• Directed graph
• Matching
• Connectivity

Signatures and Efficient Proofs on Committed Graphs and NP-Statements Thomas Groß School of Computing Science, Newcastle University, UK No Institute Given

Source URL: fc15.ifca.ai

• Graph coloring
• Graph
• Graph theory
• Signed graph
• Zero-knowledge proof
• Line graph
• Neighbourhood
• Petersen graph
• Eulerian path

Efficient Shortest Paths on Massive Social Graphs Xiaohan Zhao, Alessandra Sala, Haitao Zheng and Ben Y. Zhao Department of Computer Science, U. C. Santa Barbara, Santa Barbara, USA {xiaohanzhao, alessandra, htzheng, rav

Source URL: www.cs.ucsb.edu

• Graph theory
• Mathematics
• Discrete mathematics
• Network theory
• Edsger W. Dijkstra
• Network analysis
• Routing algorithms
• Centrality
• Shortest path problem
• Planar graph
• Pathfinding
• Social network analysis